The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
نویسندگان
چکیده
The crossing number of a graph G, cr(G), is defined as the smallest possible edge-crossings in drawing G plane. There are almost no results concerning join disconnected 6-vertex with cycle. main aim this paper to give product Q+Cn for Q consisting two 3-cycles, where Cn cycle on n vertices.
منابع مشابه
On the Crossing Number of the Join of Five Vertex Graph with the Discrete Graph
In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for a given number n. For cyclic permutations, P1 – Pm will create a graph in which to calculate the distances between all vertices of the graph. T...
متن کاملvertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملLower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle
The minimum number of crossings for all drawings of a given graph G on a plane is called its crossing number, denoted cr(G). Exact crossing numbers are known only for a few families of graphs, and even the crossing number of a complete graph Km is not known for all m. Wenping et al. showed that cr(Km2Cn) > n · cr(Km+2) for n > 4 and m > 4. We adopt their method to find a lower bound for cr(G2Cn...
متن کاملCrossing numbers of join of a graph on six vertices with a path and a cycle
The crossing number of a graph G is the minimum number of crossings of its edges among the drawings of G in the plane and is denoted by cr(G). Zarankiewicz conjectured that the crossing number of the complete bipartite graph Km,n equals . This conjecture has been verified by Kleitman for min {m, n} ≤ 6. Using this result, we give the exact values of crossing number of the join of a certain grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11102253